Filtering of Finite-State Time-Nonhomogeneous Markov Processes, a Direct Approach
نویسندگان
چکیده
منابع مشابه
Denumerable State Nonhomogeneous Markov Decision Processes
We consider denumerable state nonhomogeneous Markov decision processes and extend results from both denumerable state homogeneous and finite state nonhomogeneous problems. We show that, under weak ergodicity, accumulation points of finite horizon optima (termed algorithmic optima) are average cost optimal. We also establish the existence of solution horizons. Finally, an algorithm is presented ...
متن کاملJoint Hitting-Time Densities for Finite State Markov Processes
For a finite state Markov process and a finite collection {Γk, k ∈ K} of subsets of its state space, let τk be the first time the process visits the set Γk. We derive explicit/recursive formulas for the joint density and tail probabilities of the stopping times {τk, k ∈ K}. The formulas are natural generalizations of those associated with the jump times of a simple Poisson process. We give a nu...
متن کاملOn $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملPiggybacking Threshold Processes with a Finite State Markov Chain
The state-space representations of certain nonlinear autoregressive time series are general state Markov chains. The transitions of a general state Markov chain among regions in its state-space can be modeled with the transitions among states of a finite state Markov chain. Stability of the time series is then informed by the stationary distributions of the finite state Markov chain. This appro...
متن کاملA nonlinear fixed-lag smoother for finite-state Markov processes
The fixed-lag smoothing of random telegraph type signals is studied. The smoothers are derived by first obtaining fixed-point smoothing equations and then using a time discretization. Simulation results are described that verify the qualitative carry-over of known results for the l inear-Gaussian problem: the greater the lag, the greater the improvement; beyond a certain lag, no further improve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Optimization
سال: 2000
ISSN: 0095-4616,1432-0606
DOI: 10.1007/s002450010012